Frames, Graphs and Erasures
نویسندگان
چکیده
Two-uniform frames and their use for the coding of vectors are the main subject of this paper. These frames are known to be optimal for handling up to two erasures, in the sense that they minimize the largest possible error when up to two frame coefficients are set to zero. Here, we consider various numerical measures for the reconstruction error associated with a frame when an arbitrary number of the frame coefficients of a vector are lost. We derive general error bounds for two-uniform frames when more than two erasures occur and apply these to concrete examples. We show that among the 227 known equivalence classes of two-uniform (36,15)-frames arising from Hadamard matrices, there are 5 that give smallest error bounds for up to 8 erasures.
منابع مشابه
ar X iv : m at h / 04 06 13 4 v 1 [ m at h . FA ] 8 J un 2 00 4 FRAMES , GRAPHS AND ERASURES
Two-uniform frames and their use for the coding of vectors are the main subject of this paper. These frames are known to be optimal for handling up to two erasures, in the sense that they minimize the largest possible error when up to two frame coefficients are set to zero. Here, we consider various numerical measures for the reconstruction error associated with a frame when an arbitrary number...
متن کاملm at h . FA ] 1 1 M ar 2 00 5 FRAMES , GRAPHS AND ERASURES BERNHARD
Two-uniform frames and their use for the coding of vectors are the main subject of this paper. These frames are known to be optimal for handling up to two erasures, in the sense that they minimize the largest possible error when up to two frame coefficients are set to zero. Here, we consider various numerical measures for the reconstruction error associated with a frame when an arbitrary number...
متن کاملar X iv : m at h / 04 06 13 4 v 2 [ m at h . FA ] 8 S ep 2 00 4 FRAMES , GRAPHS AND ERASURES
Two-uniform frames and their use for the coding of vectors are the main subject of this paper. These frames are known to be optimal for handling up to two erasures, in the sense that they minimize the largest possible error when up to two frame coefficients are set to zero. Here, we consider various numerical measures for the reconstruction error associated with a frame when an arbitrary number...
متن کاملRandom Matrices and Erasure Robust Frames
Data erasure can often occur in communication. Guarding against erasures involves redundancy in data representation. Mathematically this may be achieved by redundancy through the use of frames. One way to measure the robustness of a frame against erasures is to examine the worst case condition number of the frame with a certain number of vectors erased from the frame. The term numerically erasu...
متن کاملUniform Tight Frames with Erasures
Uniform tight frames have been shown to be useful for robust data trans mission The losses in the network are modeled as erasures of transmitted frame coe cients We give the rst systematic study of the general class of uniform tight frames and their properties We search for e cient con structions of such frames We show that the only uniform tight frames with the group structure and one or two g...
متن کامل